Path Optimization Algorithm for Network Problems Using Job Sequencing Technique

The job sequencing technique is used to determine an optimal sequence. It performs a series of jobs by a number of specific orders so that it calculates the optimal cost. In this paper, we propose a novel approach to find an optimal path from source to destination by taking advantage of job sequencing technique. We have used n jobs m machine sequencing technique and this is divided into n jobs 2 machine problems. Using Johnson’s sequencing rule, we solved the problem and obtained the (n-1) sub sequences of the route. Using the proposed algorithm, we calculated the optimal sequence, which leads to the shortest path of the network.